Linear MPC with optimal prioritized infeasibility handling: application, computational issues and stability
نویسندگان
چکیده
منابع مشابه
Linear MPC with optimal prioritized infeasibility handling: application, computational issues and stability
All practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-de ned prioritization, by solving only a single linear program on-line in addition to the standard quadratic programming problem on-line. A stability result for this infeasibil...
متن کاملStabilizing Linear Mpc with Efficient Prioritized Infeasibility Handling
In order to minimize the number of situations when a model predictive controller fails to compute a control input, all practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-de ned prioritization. This infeasibility handler requires th...
متن کاملInfeasibility Handling in Linear Mpc Subject to Prioritized Constraints
All practical MPC implementations should have a means to recover from infeasibility. We propose an algorithm designed for linear state-space MPC which transforms an infeasible MPC optimization problem into a feasible one. The algorithm handles possible prioritizations among the constraints explicitly. Prioritized constraints can be seen as an intuitive and structural way to impose process knowl...
متن کاملMpc for Max-plus-linear Systems with Guaranteed Stability
Model predictive control (MPC) is a popular controller design technique in the process industry. Conventional MPC uses linear or nonlinear discrete-time models. Previously, we have extended MPC to a class of discrete event systems that can be described by a model that is “linear” in the max-plus algebra. In this paper we consider the stability of MPC for these max-plus linear (MPL) systems, and...
متن کاملSuboptimal MPC and partial enumeration: robust stability and computational performance
We revise in this paper the Partial Enumeration (PE) method for the fast computation of a suboptimal solution to linear MPC problems. We derive novel robust exponential stability results for difference inclusions to show that the existence of a continuous Lyapunov function implies Strong Robust Exponential Stability (SRES), i.e. for any sufficiently small perturbation. Given the fact that the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2001
ISSN: 0005-1098
DOI: 10.1016/s0005-1098(01)00143-1